Generating Random Permutations by Coin Tossing
نویسندگان
چکیده
منابع مشابه
Permutations and Coin-Tossing Sequences
This quote is from Herbert Wilf's delightful book generatingfunctionology [1, p. 75]. It occurs in the chapter on the exponential formula, a powerful technique for counting labelled structures formed from "connected" components. Such structures include various types of graphs, permutations (formed from cycles), and partitions (a union of blocks). Applied to permutations on n letters comprising ...
متن کاملRandom Coin Tossing
A selection of these reports is available in PostScript form at the Faculty's anonymous ftp
متن کاملA Phase Transition in Random Coin Tossing
n=1 u n < ∞ and θ is small enough, then μθ is absolutely continuous with respect to μ0. They conjectured that absolute continuity should not depend on θ, but only on the square-summability of {un}. We show that in fact the power law governing the decay of {un} is crucial, and for some renewal sequences {un}, there is a phase transition at a critical parameter θc ∈ (0, 1): for |θ| < θc the measu...
متن کاملExperimental quantum coin tossing.
In this Letter we present the first implementation of a quantum coin-tossing protocol. This protocol belongs to a class of "two-party" cryptographic problems, where the communication partners distrust each other. As with a number of such two-party protocols, the best implementation of the quantum coin tossing requires qutrits, resulting in a higher security than using qubits. In this way, we ha...
متن کاملUNBIASED COIN TOSSING WITH A BIASED COIN by
PrQcedures are exhibited and analyzed for converting a sequence of iid Bernoulli variables with unknown mean p into a Bernoulli variable with mean 1/2. The efficiency of several procedures is studied.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2017
ISSN: 1549-6325,1549-6333
DOI: 10.1145/3009909